搜索资源列表
ESNtools
- matlab下ESN的工具This software is intended for research use by experienced Matlab users and includes no warranties or services.-In alphabetical order here is what the routines are doing: analogToUnitCoded: - helper function for coding a 1-dim
ZaoShengXiaoChuDib
- 图像降噪处理：固定阈值法进行二值化、对二值图像的黑白点噪声消除、对二值图像进行消除孤立黑像素点、均值滤波处理、超限邻域平均法、n*n均值滤波处理、n*n中值滤波处理、十字型中值滤波、N*N最大值滤波、随机噪声处理、进行椒盐噪声处理、局部平均化处理。-Image noise reduction: fixed threshold binarization method for binary images in black and white spot noise elimination, the e
The_Magic_Of_Computer_Graphics
- 计算机图形学重要参考。对理解OpenGL和D3D的渲染过程有重要帮助。-Computer graphics is a vast field that is becoming larger every day. It is impossible to cover every topic of interest, even within a specialization such as CG rendering. For many years, Noriko Kurachi has reported
Nonlocal-Means
- 改进的非局部均值去噪，采用均值和方差选择相似的图像块。-Improved non-local means denoising, using the mean and variance of the to similar images.
097-paste-with-non-function-macro
- expected-error {{no matching function foo found in local scope did you mean. -expected-error {{no matching function foo found in local scope did you mean.
as245
- Active Contour Models and Level Set algorithm, as well as several articles of the GVF, the list for the article: [1] Snakes Active Contour Models.pdf [2] Multiscale Active Contours.pdf [3] Snakes, shapes, and gradient vector flow.pdf [4] Motion of le
emd-method
- 经验模态分解(EMD Empirical Mode Decomposition )算法是Hilbert-Huang变换(HHT)的核心算法。经验模态分解(EMD)算法是通过算法过程定义的，而并非由确定的理论公式定义的，所以对其进行准确的理论分析非常困难，我们目前只能借助大量的数字仿真试验不断对其性能进行深入的研究。 EMD算法的目的在于将性能不好的信号分解为一组性能较好的本征模函数（IMFIntrinsic Mode Function ），且IMF须满足以下两个性质： (1)信号的极值点(极
WindsPhoto
- 支持本地上传和远程图片，自动盗链吝啬的国内门户提供的博客/空间/相册中的图片； 缩略图和列表两种方式显示，上传时自动生成缩略图，可以设置缩略图大小、文字水印和LOGO水印； 一键设置分类相册封面，自定义相册排序方式，正序或倒序； 相册集成HighSlide、LightBox、GreyBox、ThickBox特效，并可以使用外部的Z-Blog插件；-Supports local and remote upload images automatically mean Daolian do
RRT-algorithmtype
- 针对基本快速扩展随机树(RRT)算法存在搜索过于平均、效率低下、用时较长的缺陷，提出了一种偏向目标型的改进型RRT算法。这种算法在生成随机点时以一定概率选择最终目标点作为局部目标点，使树的扩展有一个趋向于最终目标点的趋势，从而加快了算法的收敛速度，优化了规划路径-For basic fast Random Tree (RRT) search algorithm exists too mean, inefficient, long time with defects, we proposed a
bernsen
- The method uses a user-provided contrast threshold. If the local contrast (max-min) is above or equal to the contrast threshold, the threshold is set at the local midgrey value (the mean of the minimum and maximum grey values in the local window). If
imnoise_bi
- J = imnoise(I,'localvar',IMAGE_INTENSITY,VAR) adds zero-mean, Gaussian noise to an image, I, where the local variance of the noise is a function of the image intensity values in I. IMAGE_INTENSITY and VAR are vectors of the same size, and P
deimnoise2_bi
- adds zero-mean, Gaussian noise to an image, I, where the local variance of the noise is a function of the image intensity values in I. IMAGE_INTENSITY and VAR are vectors of the same size, and PLOT(IMAGE_INTENSITY,VAR) plots the functional
itoolbox
- 协同区间偏最小二乘 siPLS算法是 N rgaard等对其提出 的 iPLS方法的改进, 其基本算法步骤如下:(1)对原始谱图进行 预处理;(2)在全谱范围内建立全局偏最小二乘模型, 即上节的 模型;(3)在整个光谱区间采用 iPLS建立多个等窗口宽度的子 区间, 假设为 n个;(4)在每个子区间上建立偏最小二乘法模型, 即可得到 n个局部模型;(5)以交叉验证时的均方根误差 RMSE 值为各模型的精度衡量标准, 比较全光谱模型和各局部模型的 精度;(6)组合精度最高的局部子区间
mpiv_toolbox
- 用matlab生成特定的数字散斑图像,比方说生成一个101*101的散斑图像，里面含有200个散斑之类的(In describing the first-order properties of laser speckle under polarized illumination conditions, it is almost an article of faith that the contrast is unity. In many processing schemes, however,